Proving Injectivity of Functions via Program Inversion in Term Rewriting
نویسندگان
چکیده
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient conditions for injectivity of functions in term rewriting, which are based on program inversion. More precisely, we show that functions defined by non-erasing, convergent and sufficiently complete constructor rewrite systems are injective if the corresponding inverse-computation rewrite systems generated by the inversion framework are innermost-confluent. By using this property, we also show a syntactic sufficient-condition of injectivity.
منابع مشابه
Completion of Unraveled Term Rewriting Systems toward Program Inversion of Injective Functions
Given a constructor term rewriting system defining injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a confluent conditional term rewriting system, and unravels the conditional system into an unconditional term rewriting system. In general, the unconditional system is not confluent and thus not computationally equivalent to the conditional system. In th...
متن کاملOn Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation∗
This paper improves the existing criterion for proving confluence of a normal conditional term rewriting system (CTRS) via the Şerbănuţă-Roşu transformation, a computationally equivalent transformation of CTRSs into unconditional term rewriting systems (TRS), showing that a weakly left-linear normal CTRS is confluent if the transformed TRS is confluent. Then, we discuss usefulness of the optimi...
متن کاملProgram Inversion for Tail Recursive Functions
Program inversion is a fundamental problem that has been addressed in many different programming settings and applications. In the context of term rewriting, several methods already exist for computing the inverse of an injective function. These methods, however, usually return non-terminating inverted functions when the considered function is tail recursive. In this paper, we propose a direct ...
متن کاملThe Term Rewriting Approach to Automated Theorem Proving
Reasoning about equality has been one of the most challenging problems in automated deduction. In the past thirty years, a number of methods have been proposed. In this survey, we give an overview of one of the more successful approaches, the term rewriting method. Term rewriting was first proposed by Evans [381 and Knuth-Bendix [93]. Its original purpose was for generating canonical term rewri...
متن کاملCompletion after Program Inversion of Injective Functions
Given a constructor term rewriting system that defines injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a conditional term rewriting system that defines the inverse relations of the injective functions, and then the compiler unravels the conditional system into an unconditional term rewriting system. In general, the resulting unconditional system is no...
متن کامل